๐Ÿ‘ฉโ€๐Ÿ’ป 12973. ์ง์ง€์–ด ์ œ๊ฑฐํ•˜๊ธฐ

@Seongukbaek Posted July 24, 2022 ยท Updated July 24, 2022 ยท 2 min read

๋ฌธ์ œ

Programmers - ์ง์ง€์–ด ์ œ๊ฑฐํ•˜๊ธฐ

๐Ÿ“ Logic

for (int i = 0; i < len; i++) { char ch = s.charAt(i); char stackCh = ' '; if (!stack.isEmpty()) stackCh = stack.peek(); if (ch == stackCh) stack.pop(); else stack.push(ch); }
  • ๊ฐ™์€ ๋ฌธ์ž๋ฅผ ๋งŒ๋‚  ๋–„๊นŒ์ง€ ์Šคํƒ์— ๋ฌธ์ž๋ฅผ ๋„ฃ๋Š”๋‹ค.
  • ๊ฐ™์€ ๋ฌธ์ž๊ฐ€ ๋‚˜์˜ค๋ฉด popํ•˜๊ณ  ๊ทธ๋ ‡์ง€ ์•Š์œผ๋ฉด stack์— ๋‚จ๊ธฐ ๋•Œ๋ฌธ์—, ์ตœ์ข…์ ์œผ๋กœ ์Šคํƒ์ด ๋น„์–ด์žˆ์ง€ ์•Š๋‹ค๋ฉด ์ง์ง€์–ด ์ œ๊ฑฐํ•  ์ˆ˜ ์—†๋‹ค.

๐Ÿ“„ CODE

์ฝ”๋“œ ๋ณด๊ธฐ/์ ‘๊ธฐ๐Ÿ’ซ
import java.util.*; class Solution { public int solution(String s) { Stack<Character> stack = new Stack<>(); int len = s.length(); for (int i = 0; i < len; i++) { char ch = s.charAt(i); char stackCh = ' '; if (!stack.isEmpty()) stackCh = stack.peek(); if (ch == stackCh) stack.pop(); else stack.push(ch); } return stack.isEmpty() ? 1 : 0; } }

โœ๏ธ Review

  • ์ฒ˜์Œ์—๋Š” ์ •๊ทœํ‘œํ˜„์‹์œผ๋กœ ๊ฐ™์€ ๋ฌธ์ž๊ฐ€ 2๋ฒˆ ๋ฐ˜๋ณต๋  ๋•Œ, ์ด๋ฅผ ์ œ๊ฑฐํ•œ๋‹ค. ์ด๋ฅผ ๋ฐ˜๋ณตํ•˜๋‹ค๊ฐ€ ์ตœ์ข…์ ์œผ๋กœ๋Š” ๋ฌธ์ž์—ด์˜ ๊ธธ์ด๊ฐ€ 0์ด ๋˜๋Š”์ง€์— ๋”ฐ๋ผ ๋ฐ˜ํ™˜ํ•˜๋Š” ๋ฐฉ์‹์œผ๋กœ ๊ตฌํ˜„ํ–ˆ๋‹ค.

    • ํ•˜์ง€๋งŒ ๋ช‡๋ช‡ ํ…Œ์ผ€์—์„œ ์‹œ๊ฐ„์ดˆ๊ณผ๊ฐ€ ๋ฐœ์ƒํ–ˆ๋‹ค.
  • ๋ฌธ๋“ ์ „์— ๋ฌธ์ž์—ด ํญ๋ฐœ์ด๋ผ๋Š” ๋ฌธ์ œ๋ฅผ ํ’€๋‹ค๊ฐ€ ๋ชป ํ’€์—ˆ๋˜ ๊ธฐ์–ต์ด ๋‚ฌ๋Š”๋ฐ ๊ทธ ๋•Œ ์Šคํƒ์„ ์‚ฌ์šฉํ•ด์•ผ ํ–ˆ๋‹ค๋Š” ์ ์ด ๋– ์˜ฌ๋ž๋‹ค.
@Seongukbaek
๋ฐฐ์šฐ๊ณ  ์ •๋ฆฌํ•˜๊ณ  ๊ณต์œ ํ•˜๋Š” ๋Œ€ํ•™์ƒ ๋ฐฑ์„ฑ์šฑ์ž…๋‹ˆ๋‹ค ๐Ÿ˜€